
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 2464. -- 中山市选[2009]小明的游戏 -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>2464: 中山市选[2009]小明的游戏</h2><span class=green>Time Limit: </span>10 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>128 MB<br><span class=green>Submit: </span>46&nbsp;&nbsp;<span class=green>Solved: </span>16<br>[<a href='submitpage.php?id=2464'>Submit</a>][<a href='problemstatus.php?id=2464'>Status</a>][<a href='bbs.php?id=2464'>Discuss</a>]</center><h2>Description</h2><div class=content><div style="text-indent: 21.75pt">小明最近喜欢玩一个游戏。给定一个n * m的棋盘，上面有两种格子#和@。游戏的规则很简单：给定一个起始位置和一个目标位置，小明每一步能向上，下，左，右四个方向移动一格。如果移动到同一类型的格子，则费用是0，否则费用是1。请编程计算从起始位置移动到目标位置的最小花费。</div></div><h2>Input</h2><div class=content><div><span>&nbsp;&nbsp;&nbsp; </span>输入文件有多组数据。</div>
<div><span>&nbsp;&nbsp;&nbsp; </span>输入第一行包含两个整数n，m，分别表示棋盘的行数和列数。</div>
<div><span>&nbsp;&nbsp;&nbsp; </span>输入接下来的n行，每一行有m个格子（使用#或者@表示）。</div>
<div><span>&nbsp;&nbsp;&nbsp; </span>输入接下来一行有四个整数x1, y1, x2, y2，分别为起始位置和目标位置。</div>
<div style="text-indent: 21.2pt">当输入n，m均为0时，表示输入结束。</div></div><h2>Output</h2><div class=content><div><span>&nbsp;&nbsp;&nbsp; </span>对于每组数据，输出从起始位置到目标位置的最小花费。每一组数据独占一行。</div></div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>2 2<br />
@#<br />
#@<br />
0 0 1 1<br />
2 2<br />
@@<br />
@#<br />
0 1 1 0<br />
0 0<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>2<br />
0<br />
</span></div><h2>HINT</h2>
			<div class=content><p><p><span style="font-size: 10.5pt; font-family: 宋体; mso-ascii-font-family: 'Courier New'; mso-hansi-font-family: 'Courier New'; mso-bidi-font-family: 'Courier New'; mso-bidi-font-size: 10.0pt; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA">对于</span><span lang="EN-US" style="font-size: 10.5pt; font-family: &quot;Courier New&quot;; mso-bidi-font-size: 10.0pt; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA; mso-fareast-font-family: 宋体">100%</span><span style="font-size: 10.5pt; font-family: 宋体; mso-ascii-font-family: 'Courier New'; mso-hansi-font-family: 'Courier New'; mso-bidi-font-family: 'Courier New'; mso-bidi-font-size: 10.0pt; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA">的数据满足：</span><span lang="EN-US" style="font-size: 12pt; font-family: &quot;Times New Roman&quot;; mso-bidi-font-size: 10.0pt; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA; mso-fareast-font-family: 宋体">1 &lt; = n, m &lt;= 500</span><span style="font-size: 12pt; font-family: 宋体; mso-ascii-font-family: 'Times New Roman'; mso-hansi-font-family: 'Times New Roman'; mso-bidi-font-family: 'Times New Roman'; mso-bidi-font-size: 10.0pt; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA">。</span></p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search='></a></p></div><center>[<a href='submitpage.php?id=2464'>Submit</a>][<a href='problemstatus.php?id=2464'>Status</a>][<a href='bbs.php?id=2464'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
